Ontario: Two Trees Planted For Each One Cut?
نویسندگان
چکیده
منابع مشابه
Max Cut for Random Graphs with a Planted Partition
We give an algorithm that, with high probability, recovers a planted k-partition in a random graph, where edges within vertex classes occur with probability p and edges between vertex classes occur with probability r ≥ p + c √ p log n/n. The algorithm can handle vertex classes of different sizes and, for fixed k, runs in linear time. We also give variants of the algorithm for partitioning matri...
متن کاملOne-Sided Interval Trees
We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.
متن کاملExpansion Trees with Cut
Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first-and higher-order logic by recording the information which instances have been chosen for which quantifiers, known in the literature as expansion trees. Such a representation is inherently analytic and hence corresponds to a cut-f...
متن کاملAnalytic Cut Trees
Smullyan maintains that the importance of cut-free proofs does not stem from cut elimination per se but rather from the fact that they satisfy the subformula property. In accordance with such a viewpoint in this paper we introduce analytic cut trees, a system from which cuts cannot be eliminated but satisfying the subformula property. Like tableaux analytic cut trees are a refutation system but...
متن کاملAlgorithms for Cut Problems on Trees
We study the multicut on trees and the generalized multiway Cut on trees problems. For the multicut on trees problem, we present a parameterized algorithm that runs in time O(ρ), where ρ = √√ 2 + 1 ≈ 1.555 is the positive root of the polynomial x4−2x2−1. This improves the current-best algorithm of Chen et al. that runs in time O(1.619). For the generalized multiway cut on trees problem, we show...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Forestry Chronicle
سال: 1981
ISSN: 0015-7546,1499-9315
DOI: 10.5558/tfc57104-3